Annotated Bibliography Class Math 4779 / 5779 February 21 , 2005

This is a report on how mixed integer programming works. It starts by showing the form of a mixed integer program with n variables and m constraints. They explain the branch and bound method which is the most widely used method for solving integer programs. It goes into some detail about how the variables have only two possible restrictions, one and zero. There’s also some mention of the branch and cut method as well as the branch and price method.